Enumeration of Mapping Patterns

نویسنده

  • N. G. de Bruijn
چکیده

Pblya's enumeration theorem is generalized in the following way. We have sets R and D, and a group G acting (by means of representations) on R and D simultaneously. This induces an equivalence relation in the set of all mappings (or of all one-to-one mappings) of R into D. The number of equivalence classes is determined for both cases. The example of types of mappings of a set into itself is treated in detail.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Validation of drop plate technique for bacterial enumeration by parametric and nonparametric tests

Drop plate technique has a priority and preference compared with the spread plate procedure, because of less time, quantity of media, effort requirement, little incubator space, and less labor intensive. The objective of this research was to compare the accuracy and fidelity of drop plate method vs. spread plate method by parametric and nonparametric statistical tests. For bacterial enumeration...

متن کامل

ChoroWare: A Software Toolkit for Choropleth Map Classifications

When exploratory spatial data analyses are conducted, choropleth mapping is an important means to display 1) the patterns of the spatial observations for enumeration areas, such as counties or Census Tracts, and 2) the resulting spatial statistical outcomes. Choropleth maps group spatial observations into classes and each class is then assigned a particular color that is used to shade the enume...

متن کامل

Enumeration Schemes for Permutations Avoiding Barred Patterns

We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length 6 4. We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length > 4 or a set of barred patterns.

متن کامل

Enumeration Schemes for Words Avoiding Patterns with Repeated Letters

In this paper, we discuss the enumeration of words avoiding patterns with repeated letters. More specifically, we find recurrences (i.e. enumeration schemes) counting words avoiding any pattern of length 3 and words avoiding any monotone pattern.

متن کامل

1 N ov 2 00 6 Finite abelian subgroups of the mapping class group

The problem of enumeration of conjugacy classes of finite abelian subgroups of the mapping class group Mσ of a compact closed surface X of genus σ is considered. A complete method of enumeration is achieved for finite elementary abelian subgroups and steps are taken toward enumera-tion of finite abelian subgroups.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1972